Aim

The aim of the Floyd-Warshall Algorithm is to find the shortest paths between all pairs of vertices in a weighted graph.